Relevant Path Separation: A Faster Method for Testing Independencies in Bayesian Networks
نویسندگان
چکیده
Directed separation (d-separation) played a fundamental role in the founding of Bayesian networks (BNs) and continues to be useful today in a wide range of applications. Given an independence to be tested, current implementations of d-separation explore the active part of a BN. On the other hand, an overlooked property of d-separation implies that d-separation need only consider the relevant part of a BN. We propose a new method for testing independencies in BNs, called relevant path separation (rp-separation), which explores the intersection between the active and relevant parts of a BN. Favourable experimental results are reported.
منابع مشابه
Causal Inference on Data Containing Deterministic Relations
Data containing deterministic relations cannot be handled by current constraint-based causal learning algorithms; they entail conditional independencies that cannot be represented by a faithful graph. Violation of the faithfulness property is characterized by an information equivalence of two sets of variables with respect to a reference variable. The conditional independencies do not provide i...
متن کاملReasoning about Independence in Probabilistic Models of Relational Data
Bayesian networks leverage conditional independence to compactly encode joint probability distributions. Many learning algorithms exploit the constraints implied by observed conditional independencies to learn the structure of Bayesian networks. The rules of d -separation provide a theoretical and algorithmic framework for deriving conditional independence facts from model structure. However, t...
متن کاملOn the implication problem for probabilistic conditional independency
The implication problem is to test whether a given set of independencies logically implies another independency. This problem is crucial in the design of a probabilistic reasoning system. We advocate that Bayesian networks are a generalization of standard relational databases. On the contrary, it has been suggested that Bayesian networks are different from the relational databases because the i...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملSelecting Features by Learning Markov Blankets
In this paper I propose a novel feature selection technique based on Bayesian networks. The main idea is to exploit the conditional independencies entailed by Bayesian networks in order to discard features that are not directly relevant for classification tasks. An algorithm for learning Bayesian networks and its use in feature selection are illustrated. The advantages of this algorithm with re...
متن کامل